type github.com/andybalholm/brotli/matchfinder.tableEntry

62 uses

	github.com/andybalholm/brotli/matchfinder (current package)
		bargain1.go#L25: 	table6  [bargain1TableSize]tableEntry
		bargain1.go#L34: 	z.table6 = [bargain1TableSize]tableEntry{}
		bargain1.go#L75: 				z.table6[i] = tableEntry{}
		bargain1.go#L145: 		entry := tableEntry{offset: int32(i), val: uint32(cv)}
		bargain2.go#L25: 	table5  [bargain2TableSize]tableEntry
		bargain2.go#L26: 	table8  [bargain2TableSize]tableEntry
		bargain2.go#L35: 	z.table5 = [bargain2TableSize]tableEntry{}
		bargain2.go#L36: 	z.table8 = [bargain2TableSize]tableEntry{}
		bargain2.go#L77: 				z.table5[i] = tableEntry{}
		bargain2.go#L86: 				z.table8[i] = tableEntry{}
		bargain2.go#L158: 		entry := tableEntry{offset: int32(i), val: uint32(cv)}
		bargain3.go#L20: 	table5  [1 << 17]tableEntry
		bargain3.go#L21: 	table8  [1 << 18]tableEntry
		bargain3.go#L22: 	table12 [1 << 19]tableEntry
		bargain3.go#L31: 	z.table5 = [len(z.table5)]tableEntry{}
		bargain3.go#L32: 	z.table8 = [len(z.table8)]tableEntry{}
		bargain3.go#L33: 	z.table12 = [len(z.table12)]tableEntry{}
		bargain3.go#L74: 				z.table5[i] = tableEntry{}
		bargain3.go#L83: 				z.table8[i] = tableEntry{}
		bargain3.go#L92: 				z.table12[i] = tableEntry{}
		bargain3.go#L167: 		entry := tableEntry{offset: int32(i), val: uint32(cv)}
		trio.go#L10: 	table5      [1 << 16]tableEntry
		trio.go#L11: 	table8      [1 << 17]tableEntry
		trio.go#L12: 	table12     [1 << 18]tableEntry
		trio.go#L16: 	z.table5 = [len(z.table5)]tableEntry{}
		trio.go#L17: 	z.table8 = [len(z.table8)]tableEntry{}
		trio.go#L18: 	z.table12 = [len(z.table12)]tableEntry{}
		trio.go#L36: 				z.table5[i] = tableEntry{}
		trio.go#L45: 				z.table8[i] = tableEntry{}
		trio.go#L54: 				z.table12[i] = tableEntry{}
		trio.go#L103: 			entry := tableEntry{offset: s, val: uint32(cv)}
		trio.go#L160: 			entry := tableEntry{offset: s + 1, val: uint32(cv)}
		trio.go#L192: 				te0 := tableEntry{offset: index0, val: uint32(cv0)}
		trio.go#L208: 			entry := tableEntry{offset: s, val: uint32(cv)}
		trio.go#L285: 			te0 := tableEntry{offset: index0, val: uint32(cv0)}
		zdfast.go#L21: 	table     [zfastTableSize]tableEntry
		zdfast.go#L22: 	longTable [zdfastLongTableSize]tableEntry
		zdfast.go#L27: 	z.table = [zfastTableSize]tableEntry{}
		zdfast.go#L28: 	z.longTable = [zdfastLongTableSize]tableEntry{}
		zdfast.go#L106: 			entry := tableEntry{offset: s + z.current, val: uint32(cv)}
		zdfast.go#L153: 				z.longTable[nextHashL] = tableEntry{offset: s + 1 + z.current, val: uint32(cv)}
		zdfast.go#L204: 		te0 := tableEntry{offset: index0 + z.current, val: uint32(cv0)}
		zdfast.go#L205: 		te1 := tableEntry{offset: index1 + z.current, val: uint32(cv1)}
		zdfast.go#L226: 			entry := tableEntry{offset: s + z.current, val: uint32(cv)}
		zfast.go#L8: type tableEntry struct {
		zfast.go#L29: 	table   [zfastTableSize]tableEntry
		zfast.go#L34: 	z.table = [zfastTableSize]tableEntry{}
		zfast.go#L102: 			z.table[nextHash] = tableEntry{offset: s + z.current, val: uint32(cv)}
		zfast.go#L103: 			z.table[nextHash2] = tableEntry{offset: s + z.current + 1, val: uint32(cv >> 8)}
		zfast.go#L180: 			z.table[nextHash] = tableEntry{offset: s + z.current, val: uint32(cv)}
		zm.go#L17: 	table       [zmTableSize]tableEntry
		zm.go#L18: 	longTable   [zmLongTableSize]tableEntry
		zm.go#L22: 	z.table = [zmTableSize]tableEntry{}
		zm.go#L23: 	z.longTable = [zmLongTableSize]tableEntry{}
		zm.go#L41: 				z.table[i] = tableEntry{}
		zm.go#L50: 				z.longTable[i] = tableEntry{}
		zm.go#L95: 			entry := tableEntry{offset: s, val: uint32(cv)}
		zm.go#L127: 				z.longTable[nextHashL] = tableEntry{offset: s + 1, val: uint32(cv)}
		zm.go#L154: 		te0 := tableEntry{offset: index0, val: uint32(cv0)}
		zm.go#L176: 			entry := tableEntry{offset: s, val: uint32(cv)}
		zm.go#L194: 				z.longTable[nextHashL] = tableEntry{offset: s + 1, val: uint32(cv)}
		zm.go#L263: 			te1 := tableEntry{offset: index1, val: uint32(cv1)}